Towards the implementation of a preference-and uncertain-aware solver using answer set programming

Logic programs with possibilistic ordered disjunction (or LPPODs) are a recently defined logic-programming framework based on logic programs with ordered disjunction and possibilistic logic. The framework inherits the properties of such formalisms and merging them, it supports a reasoning which is nonmonotonic, preference-and uncertain-aware. The LPPODs syntax allows to specify 1) preferences in a qualitative way, and 2) necessity values about the certainty of program clauses. As a result at semantic level, preferences and necessity values can be used to specify an order among program solutions. This class of program therefore fits well in the representation of decision problems where a best option has to be chosen taking into account both preferences and necessity measures about information. In this paper we study the computation and the complexity of the LPPODs semantics and we describe the algorithm for its implementation following on Answer Set Programming approach. We describe some decision scenarios where the solver can be used to choose the best solutions by checking whether an outcome is possibilistically preferred over another considering preferences and uncertainty at the same time.Postprint (published version

Nested logic programs with ordered disjunction

In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LPODs+), which allows to specify qualitative preferences by means of nested preference expressions. For doing this we extend the syntax of logic programs with ordered disjunction (LPODs) to capture more general expressions. We define the LPODs+ semantics in a simple way and we extend most of the results of logic programs with ordered disjunction showing how our approach effectively is a proper generalisation of LPODs.Peer ReviewedPostprint (published version

Bringing action language C+ to normative contexts: preliminary report

C+ is an action language for specifying and reasoning about the e ects of actions and the persistence of facts over time. Based on it. we present CN+, an operational enhanced form of C+ designed for representing complex normative systems and integrate them easily into the semantics of the causal theory of actions. The proposed system contains a particular formalization of norms using a life-cycle approach to capture the whole normative meaning of a complex normative framework. We discuss this approach and illustrate it with examples.Peer ReviewedPostprint (author’s final draft

Extension-based argumentation semantics via logic programming semantics with negation as failure

Extension-based argumentation semantics have been shown to be a suitable approach for performing practical reasoning. Since extension-based argumentation semantics were formalized in terms of relationships between atomic arguments, it has been shown that extension-based argumentation semantics (such as the grounded semantics and stable semantics) can be characterized by logic programming semantics with negation as failure. Recently, it has been shown that argumentation semantics such as the preferred semantics and the CF2 semantics can be characterized in terms of logic programming semantics. In this paper, we make a short overview w.r.t. recent results in the close relationship between extension-based semantics and logic programming semantics with negation as failure. We also show that there is enough evidence to believe that the use of declarative approaches based on logic programming semantics with negation as failure is a practical approach for performing practical reasoning following an argumentation reasoning approach.Peer ReviewedPostprint (published version

CF2-extensions as answer-set models

Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. Since extension-based argumentation semantics were formalized in terms of relationships between atomic arguments, it has been shown that extension-based argumentation semantics based on admissible sets such as stable semantics can be characterized in terms of answer sets. In this paper, we present an approach for characterizing SCC-recursive semantics in terms of answer set models. In particular, we will show a characterization of CF2 in terms of answer set models. This result suggests that not only extension-based argumentation semantics based on admissible sets can be characterized in terms of answer sets; but also extension-based argumentation semantics based on Strongly Connected Components can be characterized in terms of answer sets.Peer ReviewedPreprin

A preference meta-model for logic programs with possibilistic ordered disjunction

This paper presents an approach for specifying user preferences related to services by means of a preference meta-model, which is mapped to logic programs with possibilistic ordered disjunction following a Model-Driven Methodology (MDM). MDM allows to specify problem domains by means of meta-models which can be converted to instance models or other meta-models through transformation functions. In particular we propose a preference meta-model that defines an abstract preference specification language allowing users to specify preferences in a more friendly way using models. We also present a meta-model for logic programs with possibilistic order disjunction. Then we show how we conceptually map the preference meta-model to logic programs with possibilistic ordered disjunction by means of a mapping function.Peer ReviewedPostprint (published version

Inferring preferred extensions by Pstable semantics

Given an argumentation framework AF, we present a normal program Psi_{AF}, such that the preferred extensions of AF correspond exactly with the pstable models of Psi_{AF}. Moreover, we motivate the notion of suitable codifications for developing metainterpreters of argumentation theory based on logic programming.Postprint (published version

A general schema for generating argumentation semantics from logic programming semantics

In this paper, by considering the idea that argumentation semantics can be viewed as a special form of logic programming semantics with negation as failure, we show that any logic programming semantics as the stable model semantics, the minimal models, etc., can define candidate argumentation semantics. These new argumentation semantics will overcome some of the problems of the Dung's argumentation semantics that have been discussed in the literature. The new argumentation semantics are based on a new recursive framework for logic programming semantics. This framework generalizes any logic programming semantics in order to build logic programming semantics which are always defined, satisfy the property of relevance and agree with the stable semantics for the class of stratified programs.Postprint (published version

Validación de la Versión Española de la Arizona Sexual Experience Scale (ASEX) usando medidas autoinformadas y psicofisiológicas

Assessment of sexual response and sexual functioning through self-reported measures is of relevance in the area of sexual health. The goal was to analyze the psychometric properties of the Spanish version of the Arizona Sexual Experience Scale (ASEX) in a sample of 1,105 individuals divided into two subsamples to examine and confirm the factorial structure. To evaluate both psychophysiological and subjective sexual arousal, we considered, from the total sample, 49 participants who took part in a second phase of the study. They were exposed to sexual films and they also answered the Spanish version of the ASEX, Massachusetts General Hospital Sexual Functioning Questionnaire, Sexual Opinion Survey-6, and Sexual Inhibition/Sexual Excitation Scales-Short Form. Results showed that ASEX has an unidimensional structure, good internal consistency, and construct, convergent, and discriminant validity. The scale examined it is useful measure for the assessment of sexual functioning for both clinical and research purposes.La evaluación de la respuesta sexual y el funcionamiento sexual a través de medidas autoinformadas es relevante en el área de la salud sexual. El objetivo fue analizar las propiedades psicométricas de la Arizona Sexual Experience Scale (ASEX) en una muestra de 1.105 individuos, divididos en dos submuestras para explorar y confirmar la estructura factorial. Para evaluar la activación sexual subjetiva y psicofisiológica, de la muestra total se seleccionaron 49 sujetos, los cuales participaron en una segunda fase del estudio. Estos últimos participantes visualizaron un vídeo con contenido sexual explícito, completaron las versiones españolas del ASEX, Massachusetts General Hospital Sexual Functioning Questionnaire, Sexual Opinion Survey-6 y Sexual Inhibition/Sexual Excitation Scales-Short Form. Tras los resultados se comprueba que el ASEX tiene una estructura unidimensional, buena consistencia interna y validez de constructo, convergente y discriminante. La escala examinada es útil para la evaluación del funcionamiento sexual, tanto con fines clínicos como de investigación

Validation of the Spanish Version of the Arizona Sexual Experience Scale (ASEX) Using Self-Reported and Psychophysiological Measures

Assessment of sexual response and sexual functioning through self-reported measures is of relevance in the area of sexual health. The goal was to analyze the psychometric properties of the Spanish version of the Arizona Sexual Experience Scale (ASEX) in a sample of 1,105 individuals divided into two subsamples to examine and confirm the factorial structure. To evaluate both psychophysiological and subjective sexual arousal, we considered, from the total sample, 49 participants who took part in a second phase of the study. They were exposed to sexual films and they also answered the Spanish version of the ASEX, Massachusetts General Hospital Sexual Functioning Questionnaire, Sexual Opinion Survey-6, and Sexual Inhibition/Sexual Excitation Scales-Short Form. Results showed that ASEX has an unidimensional structure, good internal consistency, and construct, convergent, and discriminant validity. The scale examined it is useful measure for the assessment of sexual functioning for both clinical and research purposes.This research has been funded through the Research Projects PSI2010-15719 (Ministry of Science and Innovation) and PSI2014-25035-R (Ministry of Economy and Competitiveness)